#include<iostream>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_set>
#include<bits/stdc++.h>
#define fi first
#define se second
#define SIZE(x) ((int)x.size())
#define out(x) cerr<<#x<<" = "<<(x)<<endl;
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
#define VI vector<int>
#define VVI vector< vector<int> >
#define VL vector<ll>
#define VVL vector<VL >
#define VC vector<char>
#define PI pair<int,int>
#define PL pair<ll,ll>
#define EPS 0.0000001


inline int lson(int x){return x<<1;}
inline int rson(int x){return (x<<1)|1;}

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}

template<typename T> 
inline void read(T &x){
	x=0;T f=1;char ch;
	do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
	do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

struct node{int a,b,c;};
//#define INF 5340172838076674L
#define INF 1000000000
#define MOD 19260817


int n,m;
node edg[10005];
int d[5005];

//P5960
int main(){
    #ifdef BUG
    freopen("a.in","r",stdin);
    #endif
	
	n=read();m=read();
	int a,b,c;
	for(int i=0;i<m;i++){
		a=read();b=read();c=read();
		edg[i]={b,a,c};
	}
	for(int i=0;i<n;i++){
		edg[i+m]={0,i+1,0};
	}
	for(int i=1;i<=n;i++)d[i]=INF;
	bool flg=false;
	//memset(d,0,sizeof d);
	d[0]=0;
	for(int i=0;i<=n;i++){
		for(int j=0;j<m+n;j++){
			if(d[edg[j].b]>d[edg[j].a]+edg[j].c){
				d[edg[j].b]=d[edg[j].a]+edg[j].c;
				if(i==n)flg=true;
			}
		}
	}
	if(flg)cout<<"No"<<endl;
	else for(int i=1;i<=n;i++)cout<<d[i]<<' ';
}
